On Interpretations of Bounded Arithmetic and Bounded Set Theory
نویسندگان
چکیده
منابع مشابه
On Interpretations of Bounded Arithmetic and Bounded Set Theory
In [5], Kaye and Wong proved the following result, which they considered to belong to the folklore of mathematical logic. Theorem 1 The first-order theories of Peano arithmetic and ZF with the axiom of infinity negated are bi-interpretable: that is, they are mutually interpretable with interpretations that are inverse to each other. In this note, I describe a theory of sets that is bi-interpret...
متن کاملOn Interpretations of Arithmetic and Set Theory
This would make an excellent starting point for any beginning research student working in the area of models of Peano arithmetic, since an understanding of how these interpretations work enables all coding techniques from set theory to be employed in arithmetic in a uniform way, and also places PA ‘on the map’ (in the sense of consistency and interpretation strength) relative to set theory. Thi...
متن کاملOn bounded functional interpretations
A unified view over well-known interpretations of intuitionistic logic, such as Gödel’s dialectica interpretation [6], Diller-Nahm interpretation [1] and Kreisel’s modified realizability [7] was achieved through a parametrised interpretation in the intuitionistic logic context [8] but also, very elegantly, in the linear logic setting (see [10], [9] and [3]). In this talk we report on work in pr...
متن کاملCuts and overspill properties in models of bounded arithmetic
In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particula...
متن کاملChapters on Bounded Arithmetic
We characterize the collapse of Buss’ bounded arithmetic in terms of the prov able collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2009
ISSN: 0029-4527
DOI: 10.1215/00294527-2009-003